Common composites of triangular polynomial systems and hash functions

Coupled systems of equations with entire and polynomial functions

We consider the coupled system$F(x,y)=G(x,y)=0$,where$$F(x, y)=bs 0 {m_1}   A_k(y)x^{m_1-k}mbox{ and } G(x, y)=bs 0 {m_2} B_k(y)x^{m_2-k}$$with entire functions $A_k(y), B_k(y)$.We    derive a priory estimates  for the sums of the rootsof the considered system andfor the counting function of  roots.

study of hash functions based on chaotic maps

توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...

Differential Polynomial Rings of Triangular Matrix Rings

coupled systems of equations with entire and polynomial functions

we consider the coupled system$f(x,y)=g(x,y)=0$,where$$f(x, y)=bs 0 {m_1}   a_k(y)x^{m_1-k}mbox{ and } g(x, y)=bs 0 {m_2} b_k(y)x^{m_2-k}$$with entire functions $a_k(y), b_k(y)$.we    derive a priory estimates  for the sums of the rootsof the considered system andfor the counting function of  roots.

Common Polynomial Lyapunov Functions for Linear Switched Systems

In this paper, we consider linear switched systems ẋ(t) = Au(t)x(t), x ∈ R, u ∈ U , and the problem of asymptotic stability for arbitrary switching functions, uniform with respect to switching (UAS for short). We first prove that, given a UAS system, it is always possible to build a common polynomial Lyapunov function. Then our main result is that the degree of that common polynomial Lyapunov f...